Distributed Probabilistic Strategies
نویسنده
چکیده
Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpreted within probabilistic strategies. W.r.t. a new definition of quantum event structure, it is shown how consistent parts of a quantum event structure are automatically probabilistic event structures, and so possess a probability measure. This gives a non-traditional take on the consistent-histories approach to quantum theory. It leads to an extension to quantum strategies. Probabilistic games extend to games with payoff, symmetry and games of imperfect information.
منابع مشابه
Distributed Probabilistic and Quantum Strategies
Building on a new definition and characterization of probabilistic event structures, a general definition of distributed probabilistic strategies is proposed. Probabilistic strategies are shown to compose, with probabilistic copy-cat strategies as identities. A higher-order probabilistic process language reminiscent of Milner’s CCS is interpretable within probabilistic strategies. W.r.t. a new ...
متن کاملStrategies with Parallel Causes
In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. Such games and their strategies have been formalised in concurrent games based on event structures. However there are limitations in founding strategies on traditional event structures. Sometimes a probabilistic distributed strategy relies on certain benign races where, intuitively, several members...
متن کاملOn Probabilistic Distributed Strategies
In a distributed game we imagine a team Player engaging a team Opponent in a distributed fashion. No longer can we assume that moves of Player and Opponent alternate. Rather the history of a play more naturally takes the form of a partial order of dependency between occurrences of moves. How are we to define strategies within such a game, and how are we to adjoin probability to such a broad cla...
متن کاملA Probabilistic Model for Best-First Search B&B Algorithms
In this paper we present a probabilistic model for analysing trees generated during problem solving using best-rst search Branch and Bound algorithm. We consider the weight associated with the edges as well as the number of children in a node to be random. The expressions obtained for the sequential algorithm are applied to several parallel strategies using a multiprocessor with distributed mem...
متن کاملConsistency-Driven Probabilistic Quorum System Construction for Improving Operation Availability
Pessimistic quorum-based data replication strategies generally strive for maximizing operation availabilities while adhering to a strict consistency notion. Unfortunately, their operation availabilities are strictly upper-bounded. Probabilistically relaxing the consistency notion permits to overcome this bound, introducing probabilistic data replication strategies that allow for a data consiste...
متن کامل